An algorithm for semi-infinite polynomial optimization
نویسندگان
چکیده
منابع مشابه
An algorithm for semi-infinite polynomial optimization
We consider the semi-infinite optimization problem: f := min x∈X {f(x) : g(x,y) ≤ 0, ∀y ∈ Yx }, where f, g are polynomials and X ⊂ R as well as Yx ⊂ R , x ∈ X, are compact basic semi-algebraic sets. To approximate f we proceed in two steps. First, we use the “joint+marginal” approach of the author [9] to approximate from above the function x 7→ Φ(x) = sup{g(x,y) : y ∈ Yx} by a polynomial Φd ≥ Φ...
متن کاملComposite semi - infinite optimization
Abstract: We consider a semi-infinite optimization problem in Banach spaces, where both the objective functional and the constraint operator are compositions of convex nonsmooth mappings and differentiable mappings. We derive necessary optimality conditions for these problems. Finally, we apply these results to nonconvex stochastic optimization problems with stochastic dominance constraints, ge...
متن کاملSubsmooth semi-infinite and infinite optimization problems
We first consider subsmoothness for a function family and provide formulas of the subdifferential of the pointwsie supremum of a family of subsmooth functions. Next, we consider subsmooth infinite and semi-infinite optimization problems. In particular, we provide several dual and primal characterizations for a point to be a sharp minimum or a weak sharp minimum for such optimization problems.
متن کاملAn Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application
An interior point constraint generation algorithm for semi-infinite optimization with healthcare application* Mohammad R. Oskoorouchi† College of Business Administration, California State University San Marcos, San Marcos, California 92096, USA, Email: [email protected] Hamid R. Ghaffari Department of Mechanical and Industrial Engineering, University of Toronto, Toronto ON, M5S 3G8, Canada, Em...
متن کاملA Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
We first present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems, and use it to develop an algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. The cutting surface algorithm is also applicable to problems with non-differentiable sem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TOP
سال: 2011
ISSN: 1134-5764,1863-8279
DOI: 10.1007/s11750-011-0172-1